Abstract Foundations of Inter-Domain Routing

نویسنده

  • Vijay Ramachandran
چکیده

Foundations of Inter-Domain Routing Vijay Ramachandran 2005 Inter-domain routing protocols establish best-effort connectivity between the independently administered networks that form the Internet. Because of the scale, heterogeneity, and autonomy of the Internet, inter-domain routes are computed using complex routing policies provided locally at each network with little global coordination. The interaction of these local policies has been shown to produce global routing anomalies, e.g., protocol oscillations and nondeterministic routing. Understanding the interaction of local policies is essential in improving Internet stability. Unfortunately, the current inter-domain routing protocol for the Internet, the Border Gateway Protocol (BGP), allows wide latitude in configuring local policies and has evolved without formal guarantees regarding its behavior. This dissertation develops a theoretical framework for the design and analysis of pathvector protocols, like BGP, used for inter-domain routing. It presents the path-vector policy system (PVPS), which is an abstract representation of the fundamental components of an inter-domain routing protocol. The framework includes an explicit notion of policy languages and global assumptions made about the network; it is shown that, while local constraints on policies alone can prevent routing anomalies, implementation of these constraints infringes on other desirable protocol properties. Thus, any design guaranteeing a reasonable combination of protocol properties requires a nontrivial global constraint on the network. Applications of these design principles are explored, including several constraint-enforcement mechanisms. Unlike many previous models of inter-domain routing, the PVPS framework can be extended to include the complexities of combining interdomain and intra-domain routing and to include policies that cannot be described as a linear preference ordering on paths. Foundations of Inter-Domain Routing A Dissertation Presented to the Faculty of the Graduate School of Yale University in Candidacy for the Degree of Doctor of Philosophy by Vijay Ramachandran Dissertation Director: Joan Feigenbaum

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RFC 1322 A Unified Approach to Inter - Domain

A Unified Approach to Inter-Domain Routing Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard. Distribution of this memo is unlimited. Abstract This memo is an informational RFC which outlines one potential approach for inter-domain routing in future global internets. The focus is on scalability to very large networks and func...

متن کامل

RFC 3221 Commentary on Inter - Domain Routing

Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document examines the various longer term trends visible within the characteristics of the Internet's BGP table and identifies a number of operational practices and protocol factors that contribute to these tre...

متن کامل

Interdomain optical routing

Node 2 NE1 NE4 Internal Abstract Node 3

متن کامل

Hybrid Inter-Domain QoS Routing based on Look-Ahead Information

Abstract: Enabling the inter-domain routing with end-to-end Quality of Service (QoS) guarantees, remains a challenge for the next generation Internet. Most of the existing research in QoS routing has been done considering a single domain. However, extending the QoS routing to the inter-domain level faces two major challenges: the scalability and the domain autonomy. In this paper, we propose a ...

متن کامل

Improved Lower Bounds for Non-utilitarian Truthfulness

One of the most fundamental results in the field of mechanism design states that every utilitarian social choice function admits a mechanism that truthfully implements it. In stark contrast with this finding, when one considers a non-utilitarian social choice function, it turns out that no guarantees can be made, i.e. there are non-utilitarian functions, which cannot be truthfully implemented. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005